package 二分查找;

import java.util.Scanner;


public class M次方根 {
    static Double N;

    static Double esp = 1e-8;

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        N = scanner.nextDouble();
        int M = scanner.nextInt();
        //二分查找
        double left = 0;
        double right = N;

        while (left + esp < right) {
            double mid = (left + right) / 2;
            if (pd(mid, M)) {
                right = mid;
            } else {
                left = mid;
            }
        }

        System.out.println(String.format("%.7f", left));
    }

    private static boolean pd(double mid, int m) {
        double pow = Math.pow(mid, m);
        if (pow>=N){
            return true;
        }else {
            return false;
        }
    }
}


